Match-Bounded String Rewriting Systems
نویسندگان
چکیده
منابع مشابه
Deciding Termination for Ancestor Match- Bounded String Rewriting Systems
Termination of a string rewriting system can be characterized by termination on suitable recursively defined languages. This kind of termination criteria has been criticized for its lack of automation. In an earlier paper we have shown how to construct an automated termination criterion if the recursion is aligned with the rewrite relation. We have demonstrated the technique with Dershowitz’s f...
متن کاملOn String Rewriting Systems
String rewriting systems, also known as semi-Thue systems, consist of a set of rules l → r, specifying valid replacements of substrings of strings over a given alphabet. In the case of one single rule, it is an open problem whether there is a system that is neither terminating nor looping. Another open question is the decidability of termination. Difficulties arise especially for non-confluent ...
متن کاملPeg - Solitaire , String Rewriting Systems
We consider a class of length-preserving string rewriting systems and show that the set of encodings of pairs of strings < s; f > such that f can be derived from s using the rewriting rules can be accepted by nite automata. As a consequence, we show the existence of a linear time algorithm for determining the solvability of a given k n peg-solitaire board, for any xed k. This result is in contr...
متن کاملObservation of String-Rewriting Systems
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain a protocol of the entire process and then use this as the computation’s result. In a series of articles this approach has proved to often exceed greatly the power of the system observed. Here we apply this architectur...
متن کاملTermination of linear bounded term rewriting systems
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bounded uniform termination, the k-bounded termination, the inverse k-bounded uniform, and the inverse kbounded problems are decidable. The k-bounded class (BO(k)) is, by definition, the set of linear systems for which e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2004
ISSN: 0938-1279,1432-0622
DOI: 10.1007/s00200-004-0162-8